On Nonadaptive Search Problem
نویسندگان
چکیده
We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2, k ≥ 2.
منابع مشابه
Non-Adaptive Data Structure Bounds for Dynamic Predecessor
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic data structures, initiated by Brody and Larsen [2]. We consider nonadaptive data structures for predecessor search in the w-bit cell probe model. Predecessor search is one of the most well-studied data structure problems. For this problem, using non-adaptivity comes at a steep price. We provide exp...
متن کاملAn Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation (Extended Abstract)
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target keyword in an ordered list of the ith block. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our argumen...
متن کاملnt - p h / 03 12 00 3 v 2 3 D ec 2 00 3 An Algorithmic Argument for Query Complexity Lower Bounds of Advised
This paper proves lower bounds of the quantum query complexity of a multiple-block ordered search problem, which is a natural generalization of the ordered search problems. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our proof employs an argument that (i) commences with the faulty assumption that a quantum algorithm of low query complexity...
متن کاملar X iv : q ua nt - p h / 03 12 00 3 v 1 2 9 N ov 2 00 3 An Algorithmic Argument for Query Complexity Lower
This paper proves lower bounds of the quantum query complexity of a multiple-block ordered search problem, which is a natural generalization of the ordered search problems. Apart from much studied polynomial and adversary methods for quantum query complexity lower bounds, our proof employs an argument that (i) commences with the faulty assumption that a quantum algorithm of low query complexity...
متن کاملNonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonadaptive quantum query algorithm that computes some total boolean function depending on n variables must make Ω(n) queries to the input in total. Second, we show that, if there exists a quantum algor...
متن کامل